Generalizing The Morley Trisector and Various Theorems with Realizability Computations
نویسنده
چکیده
This paper presents a perspective on figures in plane geometry by means of which various theorems can be systematically proved. The theorem on which this perspective is based, described in Section 2.3, has a particularly useful corollary concerning the matching of angles subtended by vertices. The approach shares some of the objectives of Wu’s method ([10] and [11]) for automation in plane geometry proofs; but the latter translates plane figures into polynomial equations via Cartesian coordinates, which is different from the approach in the present work.
منابع مشابه
Realizability Models Separating Various Fan Theorems
We develop a realizability model in which the realizers are the reals not just Turing computable in a fixed real but rather the reals in a countable ideal of Turing degrees. This is then applied to prove several separation results involving variants of the Fan Theorem.
متن کاملThe Principle of Linearity: A Short Cut to Determine Dependent Angles
We propound the principle that \if there is a relationship between angles of a planar gure, composed of straight lines set at angles (which may be constructed to be rational multiples of each other) then the relationship will be linear". We contend that this principle holds a similar status to a law of Physics, in that it is accepted because has been found to supply consistent answers and no co...
متن کاملCanonical Effective Subalgebras of Classical Algebras as Constructive Metric Completions
We prove general theorems about unique existence of effective subalgebras of classical algebras. The theorems are consequences of standard facts about completions of metric spaces within the framework of constructive mathematics, suitably interpreted in realizability models. We work with general realizability models rather than with a particular model of computation. Consequently, all the resul...
متن کاملKripke Semantics for Dependent Type Theory and Realizability Interpretations
Constructive reasoning has played an increasingly important role in the development of provably correct software. Both typed and type-free frameworks stemming from ideas of Heyting, Kleene, and Curry have been developed for extracting computations from constructive specifications. These include Realizability, and Theories based on the Curry-Howard isomorphism. Realizability – in its various typ...
متن کاملAll realizability is relative
We introduce a category of basic combinatorial objects, encompassing PCAs and locales. Such a basic combinatorial object is to be thought of as a pre-realizability notion. To each such object we can associate an indexed preorder, generalizing the construction of triposes for various notions of realizability. There are two main results: first, the characterization of triposes which arise in this...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1603.03463 شماره
صفحات -
تاریخ انتشار 2016